The 2CNF Boolean formula satisfiability problem and the linear space hypothesis
نویسندگان
چکیده
We aim at investigating the solvability/insolvability of nondeterministic logarithmic-space (NL) decision, search, and optimization problems parameterized by natural size parameters using simultaneously polynomial time sub-linear space. are particularly focused on 2SAT3—a restricted variant 2CNF Boolean (propositional) formula satisfiability problem in which each variable a given appears most 3 times form literals—parameterized total number mvbl(ϕ) variables ϕ. propose new, practical working hypothesis, called linear space hypothesis (LSH), asserts that (2SAT3,mvbl) cannot be solved only “sub-linear” (i.e., mvbl(x)εpolylog(|x|) for constant ε∈[0,1)) all instances x. Immediate consequences LSH include L≠NL, LOGDCFL≠LOGCFL, SC≠NSC. For our investigation, we fully utilize key notion “short reductions”, under class PsubLIN polynomial-time sub-linear-space solvable is indeed closed.
منابع مشابه
The 2CNF Boolean Formula Satisfiability Problem and the Linear Space Hypothesis
We aim at investigating the solvability/insolvability of nondeterministic logarithmicspace (NL) decision, search, and optimization problems parameterized by size parameters using simultaneously polynomial time and sub-linear space on multi-tape deterministic Turing machines. We are particularly focused on a special NL-complete problem, 2SAT—the 2CNF Boolean formula satisfiability problem—parame...
متن کاملLinear Programming Formulation of the Boolean Satisfiability Problem
Boolean satisfiability (SAT) is of central importance in many areas of Operations Research and Computer Science. In its general (conjunctive normal) form, the problem can be stated as follows. There is a number of Boolean (binary) variables generically called “literals,” and a number of covertype constraints implicitly defined over these variables, called “clauses.” Pairs of the literals may be...
متن کاملThe Reduction of Satisfiability Problems into 2CNF Satisfiability Problems
Many search techniques are successful in finding solutions to NP-Complete problems in polynomial-time. The search time can be improved upon by sub-dividing the variables and clauses. This sub-division generates data pairs in conjunctive normal form. Then, by using the Two-SAT algorithm, the new subset of data is solved in linear-time.
متن کاملSolving the Satisfiability Problem through Boolean Networks
$EVWUDFW. In this paper we present a new approach to solve the satisfiability problem (SAT), based on boolean networks (BN). We define a mapping between a SAT instance and a BN, and we solve SAT problem by simulating the BN dynamics. We prove that BN fixed points correspond to the SAT solutions. The mapping presented allows to develop a new class of algorithms to solve SAT. Moreover, this new a...
متن کاملThe Boolean SATisfiability Problem in Clifford algebra
We present a formulation of the Boolean Satisfiability Problem in spinor language that allows to give a necessary and sufficient condition for unsatisfiability. With this result we outline an algorithm to test for unsatisfiability with possibly interesting theoretical properties.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2023
ISSN: ['1090-2724', '0022-0000']
DOI: https://doi.org/10.1016/j.jcss.2023.03.001